Topological Complexity of Collision-free Motion Planning on Surfaces

نویسنده

  • DANIEL C. COHEN
چکیده

The topological complexity TC(X) is a numerical homotopy invariant of a topological space X which is motivated by robotics and is similar in spirit to the classical Lusternik–Schnirelmann category of X. Given a mechanical system with configuration space X, the invariant TC(X) measures the complexity of all possible motion planning algorithms designed for the system. In this paper, we compute the topological complexity of the configuration space of n distinct ordered points on an orientable surface. Our main tool is a theorem of B. Totaro describing the cohomology of configuration spaces of algebraic varieties.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Se p 20 06 Topological complexity of collision free motion planning algorithms in the presence of multiple moving obstacles

We study motion planning algorithms for collision free control of multiple objects in the presence of moving obstacles. We compute the topological complexity of algorithms solving this problem. We apply topological tools and use information about cohomology algebras of configuration spaces. The results of the paper may potentially be used in systems of automatic traffic control.

متن کامل

Collision Free Motion Planning on Graphs

A topological theory initiated in [4], [5] uses methods of algebraic topology to estimate numerically the character of instabilities arising in motion planning algorithms. The present paper studies random motion planning algorithms and reveals how the topology of the robot’s configuration space influences their structure. We prove that the topological complexity of motion planning TC(X) coincid...

متن کامل

Arrangements in Higher Dimensions: Voronoi Diagrams, Motion Planning, and Other Applications

We review recent progress in the study of arrangements of surfaces in higher dimensions. This progress involves new and nearly tight bounds on the complexity of lower envelopes, single cells, zones, and other substructures in such arrangements, and the design of eecient algorithms (near optimal in the worst case) for constructing and manipulating these structures. We then present applications o...

متن کامل

Topological property for collision-free nonholonomic motion planning: the case of sinusoidal inputs for chained form systems

This paper deals with nonholonomic motion planning including obstacle avoidance capabilities. We show that the methods developed in absence of obstacles can be extended to the problem of obstacle avoidance, provided that they verify a topological property. Such steering methods allow us to design exact and complete collision-free path planners for a large family of systems. We show that the ste...

متن کامل

Topological Complexity of Motion Planning

In this paper we study a notion of topological complexity TC(X) for the motion planning problem. TC(X) is a number which measures discontinuity of the process of motion planning in the configuration space X. More precisely, TC(X) is the minimal number k such that there are k different “motion planning rules”, each defined on an open subset of X×X, so that each rule is continuous in the source a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009